Minimal Translations from Synchronous Communication to Synchronizing Locks

In order to understand the relative expressive power of larger concurrent programming languages, we analyze translations small process calculi which model communication and synchronization processes. The source language SYNCSIMPLE is a minimalistic for message passing concurrency while target LOCKSIMPLE shared memory concurrency. former calculus with synchronous processes, latter has synchronizing mutable locations - called locks that behave similarly binary semaphores. criteria correctness they preserve reflect may-termination must-termination We show there no correct compositional translation from uses one or two locks, independent initialisation locks. also three Also variants are taken into account different blocking behavior.